Multiresolution analysis over triangles, based on quadratic Hermite interpolation
نویسندگان
چکیده
منابع مشابه
Constrained Interpolation via Cubic Hermite Splines
Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation. It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...
متن کاملHermite Interpolation Outperforms Nyström Interpolation
Hermite interpolation is shown to be much more stable than Nyström interpolation in the context of solving classic Fredholm second kind integral equations of potential theory in two dimensions using panel-based Nyström discretization. AMS subject classification (2000): 31A10,45B05,65D05,65R20.
متن کاملOn Interpolation Errors over Quadratic Nodal Triangular Finite Elements
Interpolation techniques are used to estimate function values and their derivatives at those points for which a numerical solution of any equation is not explicitly evaluated. In particular, the shape functions are used to interpolate a solution (within an element) of a partial differential equation obtained by the finite element method. Mesh generation and quality improvement are often driven ...
متن کاملGeometric Hermite Interpolation Based on the Representation of Circular Arcs ⋆
A new heuristic method of geometric Hermite interpolation is presented to construct a planar cubic rational Bézier curve with two points and two unit tangent directions. The integral, which shows the change rate of the curvature, is taken as the energy function to measure the fairness of the parameter curve. Hence the curvature of the new curve is more stable. Since that the energy function of ...
متن کاملA Recursive Algorithm for Hermite Interpolation over a Triangular Grid
A recursive algorithm for Hermite interpolation of bivariate data over triangular grids is presented. This interpolation algorithm has a dynamic programming flavor and it computes a single polynomial that interpolates the full set of data. The data we interpolate are partial derivatives and mixed partials up to some fixed order at the nodes of the grid. The interpolant is a polynomial with mini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2000
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(00)00373-3